SUPERSYMMETRY BREAKINGS AND FERMAT'S LAST THEOREM
نویسندگان
چکیده
منابع مشابه
Supersymmetry Breakings and Fermat's Last Theorem
A mechanism of supersymmetry breaking in two or four-dimensions is given, in which the breaking is related to the Fermat's last theorem. It is shown that supersymmetry is exact at some irrational number points in parameter space, while it is broken at all rational number points except for the origin. Accordingly, supersymmetry is exact almost everywhere, as well as broken almost everywhere on t...
متن کاملConstraints on Inflation Models from Supersymmetry Breakings
Effects of soft SUSY-breaking terms on inflation potentials are discussed. There exist generic constraints that must be satisfied in order not for the inflaton potential to loose its flatness. We examine explicitly the constraints in the case of a hybrid inflation model and find that the coupling constant λ between the inflaton and the “waterfall-direction” field is bounded as 2.0 × 10−6 ∼ λ. T...
متن کاملFermat’s Last Theorem
Fermat learned his number theory from the books of Diophantus; it was in the margins of his copy that he wrote down that he had discovered a truly marvelous proof of the fact that X + Y n = Z has no solutions in natural numbers for n > 2, and that the margin was too small to contain it. The books of Diophantus, including these remarks, were published posthumously by his son. By the early 1800s,...
متن کاملFermat's Last Theorem
The authors would like to give special thanks to N. Boston, K. Buzzard, and B. Conrad for providing so much valuable feedback on earlier versions of this paper. They are also grateful to A. Agboola, M. Bertolini, B. Edixhoven, J. Fearnley, R. Gross, L. Guo, F. Jarvis, H. Kisilevsky, E. Liverance, J. Manoharmayum, K. Ribet, D. Rohrlich, M. Rosen, R. Schoof, J.-P. Serre, C. Skinner, D. Thakur, J....
متن کاملThe Last Player Theorem
Game trees are an important model of decision-making situations, both in artificial intelligence and decision analysis, but many of the properties of game trees are not well understood. One of these properties is known as biasing: when a minimax search is done to an odd search depth, all moves tend to look good, and when it is done to an even search depth, all modes tend to look bad. One explan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Modern Physics Letters A
سال: 1995
ISSN: 0217-7323,1793-6632
DOI: 10.1142/s0217732395000168